Adaptive backstepping repetitive learning control design for nonlinear discrete‐time systems with periodic uncertainties

This paper addresses a tracking problem for uncertain nonlinear discrete‐time systems in which the uncertainties, including parametric uncertainty and external disturbance, are periodic with known periodicity. Repetitive learning control (RLC) is an effective tool to deal with periodic unknown components. By using the backstepping procedures, an adaptive RLC law with periodic parameter estimation is designed. The overparameterization problem is overcome by postponing the parameter estimation to the last backstepping step, which could not be easily solved in robust adaptive control. It is shown that the proposed adaptive RLC law without overparameterization can guarantee the perfect tracking and boundedness of the states of the whole closed‐loop systems in presence of periodic uncertainties. In addition, the effectiveness of the developed controller is demonstrated by an implementation example on a single‐link flexible‐joint robot. Copyright © 2014 John Wiley & Sons, Ltd.     

Multiple characteristic model‐based golden‐section adaptive control: Stability and optimization

The characteristic model‐based golden‐section adaptive control (CM‐GSAC) law has been developed for over 20 years in China with a broad range of applications in various fields. However, quite a few theoretical problems remain open despite its satisfying performance in practice. This paper revisits the stability of the CM‐GSAC from its very beginning and explores the underlying implications of the so‐called golden‐section parameter l₂≈0.618. The closed‐loop system, which consists of the CM and the GSAC, is a discrete time‐varying system, and its stability is discussed from three perspectives. First, attentions have been paid to select the optimal controller coefficients such that the closed‐loop system exhibits the best transient performance in the worst case. Second, efforts are made to improve the robustness in the presence of parameter estimation errors, which provide another choice when designing the adaptive controller. Finally, by measuring the slowly time‐varying nature in an explicit inequality form, a bridge is built between the instantaneous stability and the time‐varying stability. In order to relax the constraints on the parameter bounds of the CM, the GSAC is further extended to multiple CMs, which shows more satisfying tracking performance than that of the traditional multiple model adaptive control method. Copyright © 2014 John Wiley & Sons, Ltd.     

Fully distributed tracking control for non‐identical multi‐agent systems with matching uncertainty

This article addresses the fully distributed consensus tracking control problem of linear multi‐agent systems with parameter uncertainties. First, a new class of distributed protocol, based on the relative states of neighbors, is proposed. Theoretical analysis indicates that the considered problem can be solved if the control gain constant of the protocol is larger than the norm bound of the leader's nonlinear inputs. Furthermore, a distributed adaptive control protocol is proposed for the case without available global information. The distributed consensus tracking control problem of uncertain linear multi‐agent systems is solved based only on local information under the proposed adaptive protocol. Finally, an application in low‐Earth‐orbit satellite formation flying is provided to illustrate the theoretical results. Copyright © 2014 John Wiley & Sons, Ltd.     

A generalized global adaptive tracking control scheme for robot manipulators with bounded inputs

In this work, a generalized adaptive scheme for the global motion control of robot manipulators with constrained inputs is proposed. It gives rise to various families of bounded adaptive controllers defined through a general class of saturation functions. Compared with adaptive tracking control algorithms previously developed in a bounded input context, the proposed adaptive approach guarantees the motion control objective for any initial condition, avoiding discontinuities throughout the scheme, preventing the inputs to reach their natural saturation bounds, and permitting innovation on the saturating structure through its generalized form, giving a wide range of possibilities for performance improvement. Experimental results corroborate the efficiency of the proposed scheme. Copyright © 2014 John Wiley & Sons, Ltd.     

Nonlinear adaptive filtering using kernel‐based algorithms with dictionary adaptation

Nonlinear adaptive filtering has been extensively studied in the literature, using, for example, Volterra filters or neural networks. Recently, kernel methods have been offering an interesting alternative because they provide a simple extension of linear algorithms to the nonlinear case. The main drawback of online system identification with kernel methods is that the filter complexity increases with time, a limitation resulting from the representer theorem, which states that all past input vectors are required. To overcome this drawback, a particular subset of these input vectors (called dictionary) must be selected to ensure complexity control and good performance. Up to now, all authors considered that, after being introduced into the dictionary, elements stay unchanged even if, because of nonstationarity, they become useless to predict the system output. The objective of this paper is to present an adaptation scheme of dictionary elements, which are considered here as adjustable model parameters, by deriving a gradient‐based method under collinearity constraints. The main interest is to ensure a better tracking performance. To evaluate our approach, dictionary adaptation is introduced into three well‐known kernel‐based adaptive algorithms: kernel recursive least squares, kernel normalized least mean squares, and kernel affine projection. The performance is evaluated on nonlinear adaptive filtering of simulated and real data sets. As confirmed by experiments, our dictionary adaptation scheme allows either complexity reduction or a decrease of the instantaneous quadratic error, or both simultaneously. Copyright © 2015 John Wiley & Sons, Ltd.     

基于关键路径延时检测的自适应电压缩减技术

为了减小传统的最差情况设计方法引入的电压裕量,提出了一种变化可知的自适应电压缩减(AVS)技术,通过调整电源电压来降低电路功耗.自适应电压缩减技术基于检测关键路径的延时变化,基于此设计了一款预错误原位延时检测电路,可以检测关键路径延时并输出预错误信号,进而控制单元可根据反馈回的预错误信号的个数调整系统电压.本芯片采用SMIC180 nm工艺设计验证,仿真分析表明,采用自适应电压缩减技术后,4个目标验证电路分别节省功耗12.4％,11.3％,10.4％和11.6％.     

SiC单晶片切割力建模与自适应控制

Si C单晶因优良的物理和机械性能而大量用于大功率器件和IC行业。但由于材料的高硬度和高脆性,使其加工过程变得很困难。为此,分析了Si C单晶片切割过程,建立切割过程模型,通过F检验法进行系统阶次辨识,采用遗忘因子递推最小二乘算法在线估计模型参数,建立进给量与切割力的差分方程,设计基于最小方差自校正的切割力控制器,并进行实验验证。结果表明:控制器能够很好的跟踪不同信号,具有良好的鲁棒性,提高了Si C单晶片的加工效率和表面质量。     

基于自适应LS-SVM的柴油机废气再循环冷却控制系统设计

针对当前柴油机废气再循环冷却控制系统受到时滞问题影响,导致系统开度走势与设定走势不一致、废气再循环效果差的问题,提出基于自适应LS-SVM的柴油机废气再循环冷却控制系统;以AT89C51单片机40针作为电控单元核心部件,利用位置传感器向系统发送负载信号,利用温度传感器来传输信号并反馈至D/A转换器;在D/A转换器中,反馈信号以串行或并行方式进入寄存器,并在转换后输出电流电压,控制系统阀门在排气再循环时的开启;伺服泵采用冷却系统,为系统提供液压动力源;利用自适应LS-SVM原理计算柴油机废气再循环冷却控制目标边界值,在最小二乘支持向量机基础上,利用求解线性方程组进行优化,消除了控制误差;根据控制差的大小,调整控制系统的输出值;由试验结果可知,该系统开度走势与设定开度走势一致,且与设定开度误差为1开度,说明使用该系统具有良好稳态特性,有效克服了系统中时滞问题,废气再循环效果较好。     

Effect of vegetative bed on flow structure through a pool-riffle morphology

Natural habitats are created and developed through pool-riffle sequences in rivers, while vegetation cover could play a critical role in the sediment transfer and its quantity and quality. In this study, the effect of vegetation cover on the flow structure in a pool-riffle sequence is investigated in a laboratory flume under bed formation to compare with non-vegetated cover. In this context, instantaneous point velocities were measured by ADV to determine averaged velocity, shear velocity, root mean square velocity, friction factor, Reynolds shear stress and turbulence intensities. Results showed that the vegetation cover increases the thickness of the wall law. Meanwhile, the length of the flow separation zone in the vegetated bedform is more than in the non-vegetated bedform. Variation in roughness coefficients may cause a new boundary layer in which local flow velocities decrease. In both cases (vegetated and non-vegetated bedforms), the momentum is mostly transferred by ejection and sweep phenomena between flow and bedform.     

Finite-time adaptive fuzzy control for a class of output constrained nonlinear systems with dead-zone

The article investigates the finite-time adaptive fuzzy control for a class of nonlinear systems with output constraint and input dead-zone. First, by skillfully combining the barrier Lyapunov function, backstepping design method, and finite-time control theory, a novel adaptive state-feedback tracking controller is constructed, and the output constraint of the nonlinear system is not violated. Second, the fuzzy logic system is used to approximate unknown function in the nonlinear system. Third, the finite-time command filter is introduced to avoid the problem of “complexity explosion” caused by repeated differentiations of the virtual control signal in conventional backstepping control schemes. Meanwhile, a new saturation function is added in the compensating signal for filter error to improve control accuracy. Finally, based on Lyapunov stability analysis, all the signals of the closed-loop are proved to be semi-globally uniformly ultimately bounded, and the tracking error converges to a small neighborhood region of the origin in a finite time. A simulation example is presented to demonstrate the effectiveness for the proposed control scheme.